Stochastic Graph Neural Networks

Stochastic delayed neural networks

Stochastic Hopfield neural networks

Hopfield (1984 Proc. Natl Acad. Sci. USA 81 3088–92) showed that the time evolution of a symmetric neural network is a motion in state space that seeks out minima in the system energy (i.e. the limit set of the system). In practice, a neural network is often subject to environmental noise. It is therefore useful and interesting to find out whether the system still approaches some limit set unde...

Kernel Graph Convolutional Neural Networks

Graph kernels have been successfully applied to many graph classification problems. Typically, a kernel is first designed, and then an SVM classifier is trained based on the features defined implicitly by this kernel. This two-stage approach decouples data representation from learning, which is suboptimal. On the other hand, Convolutional Neural Networks (CNNs) have the capability to learn thei...

Gated Graph Sequence Neural Networks

Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modify to use gated recurrent units and modern optimization techniques and then ex...

Adaptive Graph Convolutional Neural Networks

Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking dat...